Approximate counting with m counters: a probabilistic analysis
نویسندگان
چکیده
Motivated by a recent paper by Cichoń and Macyna [1], who introduced m counters (instead of just one) in the approximate counting scheme first analysed by Flajolet [2], we analyse the moments of the sum of the m counters, using techniques that proved to be successful already in several other contexts [11].
منابع مشابه
Approximate counting with m counters: A detailed analysis
The classical algorithm approximate counting was recently modified by Cichon and Macyna: Instead of one counter, m counters are used, and the assignment of an incoming item to one of the counters is random. The parameter of interest is the sum of the values of all the counters. We analyse expectation and variance, getting explicit and asymptotic formulæ.
متن کاملApproximate Counting: A Detailed Analysis
Approximate counting is an algorithm proposed by R. Morris which makes it possible to keep approximate counts of large numbers in small counters. The algorithm is useful for gathering statistics of a large number of events as well as for applications related to data compression (Todd et al.). We provide here a complete analysis of approximate counting which establishes good convergence properti...
متن کاملEvaluation of the Interference of the Microwave Radiation Emitted from GSM Mobile Phones on the Performance of Cell Counters
Abstract Background and Objectives: Incidents related to electromagnetic interference with medical devices have been reported over the past decades. It has also been indicated that the microwave radiation emitted from mobile phones interferes with the operation of medical devices therefore, this study aimed at testing the interference by GSM mobile phones with cell counters. Material and Method...
متن کاملA Coin Tossing Algorithm for Counting Large Numbers of Events
"Approximate counters" are realized by probabilistic algorithms that maintain an approximate count in the interval 1 to n using only about 10921092 n bits. The algorithmic principle was proposed by R . M o r r i s [7] : Starting with counter C = 1, after n increments C should contain a good approximation to log e n . Thus C should be increased by 1 after other n increments approximately. Since ...
متن کاملFrom Weighted to Unweighted Model Counting
The recent surge of interest in reasoning about probabilistic graphical models has led to the development of various techniques for probabilistic reasoning. Of these, techniques based on weighted model counting are particularly interesting since they can potentially leverage recent advances in unweighted model counting and in propositional satisfiability solving. In this paper, we present a new...
متن کامل